#include <bits/stdc++.h>
using namespace std;
int n,top=1,died;
int a[100005];
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
	}
	sort(a+1,a+n+1);
	for(int i=1;i<=n;i++){
		if(a[i]>a[top]){
			top++;
			died++;
		}
	}
	cout<<n-died;
}
